Simple method for constructing phylogenetic trees from distance matrices.
نویسندگان
چکیده
منابع مشابه
Inferring protein interactions from phylogenetic distance matrices
Finding the interacting pairs of proteins between two different protein families whose members are known to interact is an important problem in molecular biology. We developed and tested an algorithm that finds optimal matches between two families of proteins by comparing their distance matrices. A distance matrix provides a measure of the sequence similarity of proteins within a family. Since ...
متن کاملThe transposition distance for phylogenetic trees
The search for similarity and dissimilarity measures on phylogenetic trees has been motivated by the computation of consensus trees, the search by similarity in phylogenetic databases, and the assessment of clustering results in bioinformatics. The transposition distance for fully resolved phylogenetic trees is a recent addition to the extensive collection of available metrics for comparing phy...
متن کاملTreewidth distance on phylogenetic trees
In this article we study the treewidth of the display graph, an auxiliary graph structure obtained from the fusion of phylogenetic (i.e., evolutionary) trees at their leaves. Earlier work has shown that the treewidth of the display graph is bounded if the trees are in some formal sense topologically similar. Here we further expand upon this relationship. We analyse a number of reduction rules w...
متن کاملUnderstanding phylogenies: Constructing and Interpreting Phylogenetic trees
Interpretation of phylogenetic trees is fundamental in understanding the relationships between organisms, their traits or characteristics, their ecology and even their genomic and developmental biology. As trees appear more often in basic texts, many students, and even their teachers, clearly understand little of how they are constructed and even less about what can be inferred from them about ...
متن کاملOn Digital Search Trees - A Simple Method for Constructing Balanced Binary Trees
This paper presents digital search trees, a binary tree data structure that can produce well-balanced trees in the majority of cases. Digital search tree algorithms are reviewed, and a novel algorithm for building sorted trees is introduced. It was found that digital search trees are simple to implement because their code is similar to the code for ordinary binary search trees. Experimental eva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1981
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.78.2.1085